Constrained paths in the flip-graph of regular triangulations
نویسندگان
چکیده
We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the connectivity of the flip-graph of regular triangulations that share the same vertex set. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Regular Flip Equivalence of Surface Triangulations
Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that in general N is bigger than the minimal number of vertices of a triangulation. The existence of N was known, but no estimate. This paper provides an estimate for N th...
متن کاملA result on flip - graph connectivity
A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fand, Kapranov, and Zelevinsky have shown that γ1(A) is connected. It is established here that γ2(A) is connected as well. 1. Flip-graph connec...
متن کاملOn the Chromatic Numbers of some Flip Graphs
This paper studies the chromatic number of the following four flip graphs (under suitable definitions of a flip): • the flip graph of perfect matchings of a complete graph of even order, • the flip graph of triangulations of a convex polygon (the associahedron), • the flip graph of non-crossing Hamiltonian paths of a convex point set, and • the flip graph of triangles in a convex point set. We ...
متن کاملFlip Graphs of Degree-Bounded (Pseudo-)Triangulations⋆
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that for general point sets flip graphs of minimum pseudo-triangulatio...
متن کاملOn the Chromatic Number of some Flip Graphs
In this paper we study the chromatic number of the following four flip graphs: A graph on the perfect matchings of the complete graph on 2n vertices and three graphs on the triangulations, Hamiltonian geometric non-crossing paths, and triangles respectively of a point set in convex position in the plane. We give tight bounds for the latter two cases and upper bounds for the first two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 37 شماره
صفحات -
تاریخ انتشار 2007